Revised and updated with the latest information in the field, the Fourth Edition of Computer Science Illuminated continues to engage and enlighten students on the fundamental concepts and diverse capabilities of computing. Written by two of today s most respected computer science educators, Nell Dale and John Lewis, the text provides a broad overview of the many aspects of the ...(展开全部)

This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinat...(展开全部)

This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinat...(展开全部)

This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinat...(展开全部)

This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinat...(展开全部)

在线阅读本书 Within the last decade, Geometric Algebra (GA) has emerged as a powerful alternative to classical matrix algebra as a comprehensive conceptual language and computational system for computer science. This book will serve as a standard introduction and reference to the subject for students and experts alike. As a textbook, it provides a thorough grounding in the fundament...(展开全部)

Robert Sedgewick 是普林斯顿大学计算机科学系教授，从1985年开始担任系主任。他于斯坦福大学获得博士学位，师从计算机科学界泰斗高德纳教授。他曾任Adobe公司的董事，并曾在Xerox PARC、IDA和INRIA公司担任研究员。他所编写的《算法》系列书籍令大批计算机学习者受益匪浅。 Kevin Wayne 自1998年开始在普林斯顿大学计算机科学系任教，曾荣获2014年ACM杰出教育奖以及普林大学大学多个教学方面的奖项。 Sedgewick 和 Wayne 一起开设计算机导论和数据结构与算法的入门课程，他们共同开设的MOOC课程已吸引了超过100万的学习者。

Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes hints or solutions to all quizzes and problems, and a series of YouTube videos by the author accompanies the book. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, op...(展开全部)

Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes hints or solutions to all quizzes and problems, and a series of YouTube videos by the author accompanies the book. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, op...(展开全部)